首页> 外文OA文献 >Routing Algorithms for All-Optical Networks with Power Considerations: The Unicast Case
【2h】

Routing Algorithms for All-Optical Networks with Power Considerations: The Unicast Case

机译:具有功率考虑的全光网络的路由算法:单播情况

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In this paper, we investigate the problem of routing connections in all-optical networks while allowing for degradation of routed signals by different optical components. To overcome the complexity of the problem, we divide it into two parts. First, we solve the pure RWA problem using fixed routes for every connection. Second, power assignment is accomplished by either using the smallest-gain first (SGF) heuristic or using a genetic algorithm. Numerical examples on a wide variety of networks show that (a) the number of connections established without considering the signal attenuation was most of the time greater than that achievable considering attenuation and (b) the genetic solution quality was much better than that of SGF, especially when the conflict graph of the connections generated by the linear solver is denser.
机译:在本文中,我们研究了全光网络中的路由连接问题,同时允许不同光学组件降低路由信号的质量。为了克服问题的复杂性,我们将其分为两部分。首先,我们为每个连接使用固定路由来解决纯RWA问题。其次,通过使用最小增益优先(SGF)启发式方法或使用遗传算法来完成功率分配。各种网络上的数值示例表明:(a)大多数情况下未考虑信号衰减的情况下建立的连接数大部分时间都比考虑衰减时可获得的连接数大,并且(b)遗传解决方案的质量比SGF好得多,尤其是当线性求解器生成的连接的冲突图更密集时。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号